Stochastic cycle selection in active flow networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mode Selection in Compressible Active Flow Networks.

Coherent, large-scale dynamics in many nonequilibrium physical, biological, or information transport networks are driven by small-scale local energy input. Here, we introduce and explore an analytically tractable nonlinear model for compressible active flow networks. In contrast to thermally driven systems, we find that active friction selects discrete states with a limited number of oscillatio...

متن کامل

Cycle and flow trusses in directed networks

When we represent real-world systems as networks, the directions of links often convey valuable information. Finding module structures that respect link directions is one of the most important tasks for analysing directed networks. Although many notions of a directed module have been proposed, no consensus has been reached. This lack of consensus results partly because there might exist distinc...

متن کامل

Stochastic Flow Networks for Synthesizing Target Distributions

A stochastic flow network is a directed graph with incoming edges (inputs) and outgoing edges (outputs), tokens enter through the input edges, travel stochastically in the network and can exit the network through the output edges. Each node in the network is a splitter, namely, a token can enter a node through an incoming edge and exit on one of the output edges according to a predefined probab...

متن کامل

Stochastic Assessment of Voltage Sags in Distribution Networks

This paper compares fault position and Monte Carlo methods as the most common methods in stochastic assessment of voltage sags. To compare their abilities, symmetrical and unsymmetrical faults with different probability distribution of fault positions along the lines are applied in a test system. The voltage sag magnitude in different nodes of test system is calculated. The problem with the...

متن کامل

Utility Maximising Dynamic Route Selection in Acyclic Stochastic Networks

In this paper, we consider the stochastic shortest path problem where the objective is to maximise the decision maker's expected utility when she has some non-linear preference towards the distribution of outcomes (e.g., total travel time). There are a small number of studies which address this problem, and a limitation of them is that they determine a static solution which does not account for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the National Academy of Sciences

سال: 2016

ISSN: 0027-8424,1091-6490

DOI: 10.1073/pnas.1603351113